const runtime.ptrBits
102 uses
runtime (current package)
arena.go#L560: for i := uintptr(0); i < nb; i += ptrBits {
arena.go#L562: if k > ptrBits {
arena.go#L563: k = ptrBits
arena.go#L606: h.low = offset / goarch.PtrSize % ptrBits
arena.go#L621: if h.valid+valid <= ptrBits {
arena.go#L631: h.mask = bits >> (ptrBits - h.valid) // leftover for next word
arena.go#L632: h.valid += valid - ptrBits // have h.valid+valid bits, writing ptrBits of them
arena.go#L635: idx := h.offset / (ptrBits * goarch.PtrSize)
arena.go#L645: h.offset += ptrBits * goarch.PtrSize
arena.go#L656: for words > ptrBits {
arena.go#L657: h = h.write(s, 0, ptrBits)
arena.go#L658: words -= ptrBits
arena.go#L675: z := ptrBits - h.valid
arena.go#L685: idx := h.offset / (ptrBits * goarch.PtrSize)
arena.go#L698: h.offset += ptrBits * goarch.PtrSize
arena.go#L707: idx := h.offset / (ptrBits * goarch.PtrSize)
arena.go#L708: if zeros < ptrBits {
arena.go#L711: } else if zeros == ptrBits {
arena.go#L716: zeros -= ptrBits
arena.go#L718: h.offset += ptrBits * goarch.PtrSize
malloc_generated.go#L117: i := o / ptrBits
malloc_generated.go#L118: j := o % ptrBits
malloc_generated.go#L122: if bits > ptrBits || (!bitsIsPowerOfTwo && j+bits > ptrBits) {
malloc_generated.go#L124: bits0 := ptrBits - j
malloc_generated.go#L133: *dst = (*dst)&^(((1<<(min(bits, ptrBits)))-1)<<j) | (src << j)
malloc_generated.go#L270: i := o / ptrBits
malloc_generated.go#L271: j := o % ptrBits
malloc_generated.go#L275: if bits > ptrBits || (!bitsIsPowerOfTwo && j+bits > ptrBits) {
malloc_generated.go#L277: bits0 := ptrBits - j
malloc_generated.go#L286: *dst = (*dst)&^(((1<<(min(bits, ptrBits)))-1)<<j) | (src << j)
malloc_generated.go#L423: i := o / ptrBits
malloc_generated.go#L424: j := o % ptrBits
malloc_generated.go#L428: if bits > ptrBits || (!bitsIsPowerOfTwo && j+bits > ptrBits) {
malloc_generated.go#L430: bits0 := ptrBits - j
malloc_generated.go#L439: *dst = (*dst)&^(((1<<(min(bits, ptrBits)))-1)<<j) | (src << j)
malloc_generated.go#L576: i := o / ptrBits
malloc_generated.go#L577: j := o % ptrBits
malloc_generated.go#L581: if bits > ptrBits || (!bitsIsPowerOfTwo && j+bits > ptrBits) {
malloc_generated.go#L583: bits0 := ptrBits - j
malloc_generated.go#L592: *dst = (*dst)&^(((1<<(min(bits, ptrBits)))-1)<<j) | (src << j)
malloc_generated.go#L729: i := o / ptrBits
malloc_generated.go#L730: j := o % ptrBits
malloc_generated.go#L734: if bits > ptrBits || (!bitsIsPowerOfTwo && j+bits > ptrBits) {
malloc_generated.go#L736: bits0 := ptrBits - j
malloc_generated.go#L745: *dst = (*dst)&^(((1<<(min(bits, ptrBits)))-1)<<j) | (src << j)
malloc_generated.go#L882: i := o / ptrBits
malloc_generated.go#L883: j := o % ptrBits
malloc_generated.go#L887: if bits > ptrBits || (!bitsIsPowerOfTwo && j+bits > ptrBits) {
malloc_generated.go#L889: bits0 := ptrBits - j
malloc_generated.go#L898: *dst = (*dst)&^(((1<<(min(bits, ptrBits)))-1)<<j) | (src << j)
malloc_generated.go#L1035: i := o / ptrBits
malloc_generated.go#L1036: j := o % ptrBits
malloc_generated.go#L1040: if bits > ptrBits || (!bitsIsPowerOfTwo && j+bits > ptrBits) {
malloc_generated.go#L1042: bits0 := ptrBits - j
malloc_generated.go#L1051: *dst = (*dst)&^(((1<<(min(bits, ptrBits)))-1)<<j) | (src << j)
malloc_generated.go#L2037: i := o / ptrBits
malloc_generated.go#L2038: j := o % ptrBits
malloc_generated.go#L2042: if bits > ptrBits || (!bitsIsPowerOfTwo && j+bits > ptrBits) {
malloc_generated.go#L2044: bits0 := ptrBits - j
malloc_generated.go#L2053: *dst = (*dst)&^(((1<<(min(bits, ptrBits)))-1)<<j) | (src << j)
malloc_stubs.go#L587: i := o / ptrBits
malloc_stubs.go#L588: j := o % ptrBits
malloc_stubs.go#L599: if bits > ptrBits || (!bitsIsPowerOfTwo && j+bits > ptrBits) {
malloc_stubs.go#L601: bits0 := ptrBits - j
malloc_stubs.go#L610: *dst = (*dst)&^(((1<<(min(bits, ptrBits)))-1)<<j) | (src << j) // We're taking the min so this compiles on 32 bit platforms. But if bits > ptrbits we always take the other branch
mbitmap.go#L226: tp.mask ^= uintptr(1) << (i & (ptrBits - 1))
mbitmap.go#L255: if tp.addr+goarch.PtrSize*ptrBits >= tp.elem+tp.typ.PtrBytes {
mbitmap.go#L259: tp.addr += ptrBits * goarch.PtrSize
mbitmap.go#L269: if tp.addr+goarch.PtrSize*ptrBits > limit {
mbitmap.go#L270: bits := (tp.addr + goarch.PtrSize*ptrBits - limit) / goarch.PtrSize
mbitmap.go#L271: tp.mask &^= ((1 << (bits)) - 1) << (ptrBits - bits)
mbitmap.go#L294: if tp.addr+goarch.PtrSize*ptrBits > limit {
mbitmap.go#L295: bits := (tp.addr + goarch.PtrSize*ptrBits - limit) / goarch.PtrSize
mbitmap.go#L296: tp.mask &^= ((1 << (bits)) - 1) << (ptrBits - bits)
mbitmap.go#L308: tp.addr = tp.elem + alignDown(n-(tp.elem-oldelem), ptrBits*goarch.PtrSize)
mbitmap.go#L310: tp.addr += alignDown(n, ptrBits*goarch.PtrSize)
mbitmap.go#L330: if tp.addr+goarch.PtrSize*ptrBits > limit {
mbitmap.go#L331: bits := (tp.addr + goarch.PtrSize*ptrBits - limit) / goarch.PtrSize
mbitmap.go#L332: tp.mask &^= ((1 << (bits)) - 1) << (ptrBits - bits)
mbitmap.go#L597: i := (addr - span.base()) / goarch.PtrSize / ptrBits
mbitmap.go#L598: j := (addr - span.base()) / goarch.PtrSize % ptrBits
mbitmap.go#L604: if j+bits > ptrBits {
mbitmap.go#L606: bits0 := ptrBits - j
mbitmap.go#L658: i := o / ptrBits
mbitmap.go#L659: j := o % ptrBits
mbitmap.go#L661: if j+bits > ptrBits {
mbitmap.go#L663: bits0 := ptrBits - j
mbitmap.go#L1016: for i := uintptr(0); i < ptrBits; i++ {
mbitmap.go#L1408: const ptrBits = 8 * goarch.PtrSize
mgcmark_greenteagc.go#L1072: i := (addr - spanBase) / goarch.PtrSize / ptrBits
mgcmark_greenteagc.go#L1073: j := (addr - spanBase) / goarch.PtrSize % ptrBits
mgcmark_greenteagc.go#L1079: if j+bits > ptrBits {
mgcmark_greenteagc.go#L1081: bits0 := ptrBits - j